a(a(b(x1))) → b(b(c(a(a(a(x1))))))
b(c(a(x1))) → x1
↳ QTRS
↳ DependencyPairsProof
a(a(b(x1))) → b(b(c(a(a(a(x1))))))
b(c(a(x1))) → x1
A(a(b(x1))) → A(x1)
A(a(b(x1))) → A(a(x1))
A(a(b(x1))) → B(c(a(a(a(x1)))))
A(a(b(x1))) → B(b(c(a(a(a(x1))))))
A(a(b(x1))) → A(a(a(x1)))
a(a(b(x1))) → b(b(c(a(a(a(x1))))))
b(c(a(x1))) → x1
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
A(a(b(x1))) → A(x1)
A(a(b(x1))) → A(a(x1))
A(a(b(x1))) → B(c(a(a(a(x1)))))
A(a(b(x1))) → B(b(c(a(a(a(x1))))))
A(a(b(x1))) → A(a(a(x1)))
a(a(b(x1))) → b(b(c(a(a(a(x1))))))
b(c(a(x1))) → x1
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ QDPOrderProof
A(a(b(x1))) → A(x1)
A(a(b(x1))) → A(a(x1))
A(a(b(x1))) → A(a(a(x1)))
a(a(b(x1))) → b(b(c(a(a(a(x1))))))
b(c(a(x1))) → x1
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
A(a(b(x1))) → A(x1)
A(a(b(x1))) → A(a(x1))
A(a(b(x1))) → A(a(a(x1)))
The value of delta used in the strict ordering is 16.
POL(c(x1)) = 1/2 + (1/4)x_1
POL(a(x1)) = (2)x_1
POL(A(x1)) = (4)x_1
POL(b(x1)) = 2 + (2)x_1
a(a(b(x1))) → b(b(c(a(a(a(x1))))))
b(c(a(x1))) → x1
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ PisEmptyProof
a(a(b(x1))) → b(b(c(a(a(a(x1))))))
b(c(a(x1))) → x1